Welcome![Sign In][Sign Up]
Location:
Search - Fast Fourier Transform

Search list

[Mathimatics-Numerical algorithmsFFTDLL

Description: 快速傅立叶变换-Fast Fourier Transform
Platform: | Size: 27648 | Author: kexiyong | Hits:

[DSP program2407FFT

Description: 快速傅立叶变换(FFT)的原理。 2407的FFT的程序代码 -Fast Fourier Transform (FFT) principle. The 2407 code FFT
Platform: | Size: 19456 | Author: 于萧 | Hits:

[Graph programFFT_DCT

Description: 快速傅立叶变换和离散余弦变换的简单实现,有一些小问题,就不修复了,呵呵。-fast Fourier transform and discrete cosine transform a simple, and it is only a small problem, not repaired, huh.
Platform: | Size: 357376 | Author: asly | Hits:

[DSP programC54xxcfft256

Description: TMS320C54系列DSP的256点快速傅立叶变换源代码,可以直接运用于54系列DSP。-TMS320C54 DSP 256 series point fast Fourier transform source code, 54 can be directly applied Series DSP.
Platform: | Size: 12288 | Author: | Hits:

[AlgorithmFFT.c

Description: Fast Fourier Transform using MPI libraries (Source Code)
Platform: | Size: 3072 | Author: Chitra | Hits:

[Special EffectsTwoDimensionalFastFourierTransform

Description: 本实验要求开发一个2-D FFT程序包,使其可以应用于后续的几个实验。这个程序需要完成的功能是用因子(-1)^(x+y)乘以输入图像以实现滤波的中心变换,并还要求用一个实矩阵乘以一个复数矩阵通过调用两个图像的乘法程序来实现对应元素的相乘,同时计算反傅立叶变换,得到的结果乘以(-1)^(x+y)并取其实部最后计算频谱。实验中用到傅立叶变换的基本公式,通过实验我们可以更加深刻的理解频域滤波的基础。-The experiment calls for the development of a 2-D FFT package so that it can be applied to a number of follow-up experiment. This process needs to be done is to factor the function (-1) ^ (x+ y) multiplied by the input image to achieve the center of filter change, and also requires a real matrix multiplied by a complex matrix by calling the two images of the multiplication process to achieve multiplication of the corresponding elements, calculating the anti-Fourier transform at the same time, the result multiplied by (-1) ^ (x+ y) and check the final calculation of the Department of the spectrum in fact. Fourier transform experiment used the basic formula, we can experiment more profound understanding of the basis of frequency domain filtering.
Platform: | Size: 142336 | Author: jhm | Hits:

[VHDL-FPGA-VerilogFFT_16

Description: FFT快速傅立叶变换-verilog,基于verilog的FFT源码,QuartusII上仿真通过-FFT Fast Fourier Transform-verilog, the FFT-based verilog source, QuartusII through the simulation
Platform: | Size: 741376 | Author: fisher | Hits:

[AlgorithmFFT

Description: Fast Fourier transform algorithm for Delphi.
Platform: | Size: 396288 | Author: Serg | Hits:

[Algorithmfft2d

Description: 2D implementation of Fast Fourier Transform
Platform: | Size: 1024 | Author: lumoder | Hits:

[Speech/Voice recognition/combineDWTFFT

Description: 一个小波+快速傅立叶变换的人脸识别程序,程序简单,效果好-A wavelet+ Fast Fourier Transform for Face Recognition Procedure
Platform: | Size: 2048 | Author: Louis lu | Hits:

[transportation applicationsfft

Description: Program FFT.FOR This FORTRAN program calculates the fast Fourier transform of a timeseries (real and/or complex) or the inverse Fourier transform of spectral components (real and/or complex). The FFT is based on the algorithm given in Numerical Recipes, Cambridge University Press, 1994.-Program FFT.FOR This FORTRAN program calculates the fast Fourier transform of a timeseries (real and/or complex) or the inverse Fourier transform of spectral components (real and/or complex). The FFT is based on the algorithm given in Numerical Recipes, Cambridge University Press, 1994.
Platform: | Size: 71680 | Author: 梦回 | Hits:

[BooksDelphi

Description: delphi 常用算法介绍 比如 傅里叶算法 快速傅里叶算法 -delphi common algorithms such as Fourier algorithm introduced Fast Fourier Transform Algorithm
Platform: | Size: 6192128 | Author: 方法 | Hits:

[Special EffectsNEW-fast-fourier-transform-in-C

Description: 该C语言程序是对一个离散的函数进行快速傅里叶的变换,在工程上能够有很好的运用。-use fast fourier to transform a funtion in C language, which can be used widely in engineering affairs
Platform: | Size: 2048 | Author: johnson chen | Hits:

[matlabFast-Fourier-base-4

Description: 通过matlab编程,实现了快速傅里叶基4的变换-Through matlab programming, achieve a fast Fourier transform base 4
Platform: | Size: 1024 | Author: | Hits:

[JSP/JavaFourier-transform

Description: 一维的快速傅里叶变换。输入2n次方数组。输出变换后的系数数组。非递归实现-One-dimensional Fast Fourier Transform. Enter 2n th array. Transformed coefficients output array. Non-recursive implementation
Platform: | Size: 11264 | Author: bingbing | Hits:

[Program docFast-fourier-Transform

Description: to find the discrete fourier transform using the fast fourier algorithm, any sequence of lengths which are multiples of 2 simply append zeros to satisfy this requirement
Platform: | Size: 1024 | Author: jachawk | Hits:

[Otherfast-fourier-transfor

Description: in this file you will learn the FFT understand the details of fast fourier transform percisely
Platform: | Size: 89088 | Author: saber | Hits:

[Communication-MobileN-point-Fast-Fourier-Transform

Description: n point fourier transform
Platform: | Size: 24576 | Author: satya | Hits:

[AlgorithmFast-Fourier-Transform

Description: 有了傅立叶变换,我们可以从信号的频域特征去分析信号。尤其在无线通信系统 中,傅里叶变换的重要性就更加明显了,无论是设计者还是测试工程师,在工作中都会和傅立叶变换打交道。-With the Fourier transform, we can go to analyze signals the frequency domain characteristics of the signal. Especially in a wireless communication system, the importance of the Fourier transform becomes more apparent, whether designers or test engineers are at work and dealing with the Fourier transform.
Platform: | Size: 317440 | Author: 毛巴马 | Hits:

[Algorithmfast-fourier-transforms-22.1

Description: FT是一种FT的高效算法,称为快速傅立叶变换(fast Fourier transform),它根据离散傅氏变换的奇、偶、虚、实等特性,对离散傅立叶变换的算法进行改进获得的。(FT is an efficient algorithm for DEFT, called fast U Lie transform (fast Fourier transform). It is obtained by improving the algorithm of discrete U Lie transform according to the odd, even, virtual and real properties of the discrete Fourier transform. fast Fourier transform algorithm can be divided into time extraction algorithm and frequency extraction algorithm.First,the basic principle of FT is briefly introduced.)
Platform: | Size: 4170752 | Author: wecol | Hits:
« 1 2 3 4 56 7 8 9 10 ... 50 »

CodeBus www.codebus.net